Coagulation‐Fragmentation Equations with Multiplicative Coagulation Kernel and Constant Fragmentation Kernel
نویسندگان
چکیده
We study a critical case of coagulation-fragmentation equations with multiplicative coagulation kernel and constant fragmentation kernel. Our method is based on the viscosity solutions to new singular Hamilton-Jacobi equation, which results from applying Bernstein transform original equation. include well-posedness, regularity, long-time behaviors equation in certain regimes, have implications well-posedness mass-conserving © 2021 Wiley Periodicals LLC.
منابع مشابه
Self-similar Solutions to a Coagulation Equation with Multiplicative Kernel
Existence of self-similar solutions to the Oort-Hulst-Safronov coagulation equation with multiplicative coagulation kernel is established. These solutions are given by s(t)−τ ψτ (y/s(t)) for (t, y) ∈ (0, T )×(0,∞), where T is some arbitrary positive real number, s(t) = ((3−τ)(T − t))−1/(3−τ) and the parameter τ ranges in a given interval [τc, 3). In addition, the second moment of these self-sim...
متن کاملOptimal bounds for self-similar solutions to coagulation equations with multiplicative kernel
We consider mass-conserving self-similar solutions of Smoluchowski’s coagulation equation with multiplicative kernel of homogeneity 2λ ∈ (0, 1). We establish rigorously that such solutions exhibit a singular behavior of the form x−(1+2λ) as x → 0. This property had been conjectured, but only weaker results had been available up to now.
متن کاملA Direct Simulation Method for the Coagulation-Fragmentation. Equations with Multiplicative Coagulation Kernels
This paper introduces a fast method of direct simulation for the stochastic process corresponding to coagulation-fragmentation dynamics with multiplica-tive coagulation kernels. Convergence results and error estimates are proved in a case where the corresponding deterministic equations are known to have a unique solution, as well as a relative compactness property of the family of stochastic pr...
متن کاملImage subtraction with non - constant kernel solutions
It is demonstrated that non-constant kernel solution, that can fit the spatial variations of the kernel can be obtained with minimum computing time. The CPU cost required with this new extension of the image subtraction method is almost the same as for fitting constant kernel solution. The method is demonstrated with a serie of Monte-Carlo images. Differential PSF variations and differential ro...
متن کاملMultiplicative updates For Non-Negative Kernel SVM
We present multiplicative updates for solving hard and soft margin support vector machines (SVM) with non-negative kernels. They follow as a natural extension of the updates for non-negative matrix factorization. No additional parameter setting, such as choosing learning, rate is required. Experiments demonstrate rapid convergence to good classifiers. We analyze the rates of asymptotic converge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Pure and Applied Mathematics
سال: 2021
ISSN: ['1097-0312', '0010-3640']
DOI: https://doi.org/10.1002/cpa.21979